On the Throughput Efficiency of Greedy Maximal Scheduling in Wireless

Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in degraded throughput performance in general wireless networks. In this thesis, we derive performance bounds of GMS for wireless networks under the general k-hop interference model. In particular, we prove that GMS achieves 100% throughput in all networks with eight nodes or less, under the two-hop interference model. Further, the obtained performance bounds improve upon previous results for larger networks up to a certain size. We also provide a simple proof to show that GMS can be implemented using only local neighborhood information in networks of any size.